Generating Spreadsheet-Like Tools from Strong Attribute Grammars
نویسندگان
چکیده
This paper presents techniques for the formal specification and efficient incremental implementation of spreadsheet-like tools. The spreadsheets are specified by strong attribute grammars. In this style of attribute grammar programming every single inductive computation is expressed within the attribute grammar formalism. Well-known attribute grammar techniques are used to reason about such grammars. For example, ordered scheduling algorithms can be used to statically guarantee termination of the attribute grammars and to derive efficient implementations. A strong attribute grammar for a spreadsheet is defined and the first incremental results are presented.
منابع مشابه
An Introductory Tutorial on JastAdd Attribute Grammars
JastAdd is an open-source system for generating compilers and other language-based tools. Its declarative specification language is based on reference attribute grammars and object-orientation. This allows tools to be implemented as composable extensible modules, as exemplified by JastAddJ, a complete extensible Java compiler. This tutorial gives an introduction to JastAdd and its core attribut...
متن کاملEmbedding Domain Specific Languages in the Attribute Grammar Formalism
This paper presents techniques for the design and implementation of domain specific languages. Our techniques are based on higher-order attribute grammars. Formal languages are specified in the classical attribute formalism and domain specific languages are embedded in the specification via higher-order attributes. We present a domain specific language for prettyprinting and we show how such la...
متن کاملAttribute Grammars and Automatic Complexity Analysis Attribute Grammars and Automatic Complexity Analysis Attribute Grammars and Automatic Complexity Analysis
Decomposable combinatorial structures have been well studied and a systematic manner for determining generating function equations is well known. Attribute grammars have enhanced the study of context-free grammars by giving meaning to constructions. Delest and F edou 2] showed that attribute grammars extend to combinatorial structures, with applications to random generation. In a similar way, w...
متن کاملFormalising and Verifying Reference Attribute Grammars in Coq
Reference attribute grammars are a powerful formalism for concisely specifying and implementing static analyses. While they have proven their merit in practical applications, no attempt has so far been made to rigorously verify correctness properties of the resulting systems. We present a general method for formalising reference attribute grammars in the theorem prover Coq. The formalisation is...
متن کاملSSCC: A Software Tool Based on Extended Ordered Attribute Grammars
Attribute grammars are a formalism for specifying computations on syntax trees. SSCC (a Sufficiently Smart Compiler Compiler) is a practical attribute-grammar system based on a polynomial-time extension to Kastens’s ordered attribute grammars. The new class of attribute grammars is strictly larger than the class of ordered attribute grammars, and it retains the property that there is a polynomi...
متن کامل